Two-round Multiparty Secure Computation from Minimal Assumptions
نویسندگان
چکیده
We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming minimal assumption that oblivious transfer (OT) exists. If assumed OT protocol is against semi-honest adversaries (in plain model) then so our MPC protocol. Similarly, if malicious common random/reference string Previously, were only known under relatively stronger computational assumptions.
منابع مشابه
Two-Round Multiparty Secure Computation from Minimal Assumptions
We provide new two-round multiparty secure computation (MPC) protocols assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest adversaries (in the plain model) then so is our tworound MPC protocol. Similarly, if the assumed two-round OT protocol is secure against malicious adversaries (in the common random...
متن کاملTwo-Round Multiparty Secure Computation Minimizing Public Key Operations
We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) poly(n, λ) invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and poly(λ, |C|) cheaper one-way function calls, where λ is the security parameter, n is the number of parties, and C is the circuit being computed. All previous...
متن کاملRound Efficient Unconditionally Secure Multiparty Computation Protocol
In this paper, we propose a round efficient unconditionally secure multiparty computation (UMPC) protocol in information theoretic model with n > 2t players, in the absence of any physical broadcast channel, which communicates O(n4) field elements per multiplication and requires O(n log(n) + D) rounds, even if up to t players are under the control of an active adversary having unbounded computi...
متن کاملOn 2-Round Secure Multiparty Computation
Substantial efforts have been spent on characterizing the round complexity of various cryptographic tasks. In this work we study the round complexity of secure multiparty computation in the presence of an active (Byzantine) adversary, assuming the availability of secure point-to-point channels and a broadcast primitive. It was recently shown that in this setting three rounds are sufficient for ...
متن کاملSecure Multiparty Computation with Minimal Interaction
We revisit the question of secure multiparty computation (MPC) with two rounds of interaction. It was previously shown by Gennaro et al. (Crypto 2002) that 3 or more communication rounds are necessary for general MPC protocols with guaranteed output delivery, assuming that there may be t ≥ 2 corrupted parties. This negative result holds regardless of the total number of parties, even if broadca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2022
ISSN: ['0004-5411', '1557-735X']
DOI: https://doi.org/10.1145/3566048